A notion of functional completeness for first-order structure
نویسندگان
چکیده
Using -congruences and implications, Weaver (1993) introduced the concepts of prevariety and quasivariety of first-order structures as generalizations of the corresponding concepts for algebras. The notion of functional completeness on algebras has been defined and characterized by Burris and Sankappanavar (1981), Kaarli and Pixley (2001), Pixley (1996), and Quackenbush (1981). We study the notion of functional completeness with respect to -congruences. We extend some results on functionally complete algebras to first-order structures A = (A;FA;RA) and find conditions for these structures to have a compatible Pixley function which is interpolated by term functions on suitable subsets of the base set A.
منابع مشابه
A Notion of Functional Completeness for First Order Structures II: Quasiprimality
Quasi-varieties of first-order structures were studied by N. Weaver [7] to generalize varieties of algebras; he also established some Malcev like conditions for these classes of structures. Following this line we extend some results of functional completeness of algebras to firstorder structures. Specifically, we formulate and characterize a notion of quasiprimality for first-order structures.
متن کاملON COMPACTNESS AND G-COMPLETENESS IN FUZZY METRIC SPACES
In [Fuzzy Sets and Systems 27 (1988) 385-389], M. Grabiec in- troduced a notion of completeness for fuzzy metric spaces (in the sense of Kramosil and Michalek) that successfully used to obtain a fuzzy version of Ba- nachs contraction principle. According to the classical case, one can expect that a compact fuzzy metric space be complete in Grabiecs sense. We show here that this is not the case,...
متن کاملAlgebraic Logic, I Quantifier Theories and Completeness Theorems
Algebraic logic studies algebraic theories related to proposition and first-order logic. A new algebraic approach to first-order logic is sketched in this paper. We introduce the notion of a quantifier theory, which is a functor from the category of a monad of sets to the category of Boolean algebras, together with a uniquely determined system of quantifiers. A striking feature of this approach...
متن کاملOn the Completeness of Dynamic Logic
The impossibility of semantically complete deductive calculi for logics for imperative programs has led to the study of two alternative approaches to completeness: “local” semantic completeness on the one hand (Cook’s relative completeness, Harel’s Arithmetical completeness), and completeness with respect to other forms of reasoning about programs, on the other. However, local semantic complete...
متن کاملCompleteness of Hutton $[0,1]$-quasi-uniformities induced by a crisp uniformity
In cite{Kats84}, Katsaras introduced a method for constructing a Hu-tton $[0,1]$-quasi-uniformity from a crisp uniformity. In this paper we present other different methods for making this based mainly in the concept of a fuzzy uniform structure. Furthermore, we prove that some of these methods preserve the completeness property of the quasi-uniformity. Moreover, we also show that Katsaras' con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Math. Mathematical Sciences
دوره 2005 شماره
صفحات -
تاریخ انتشار 2005